Model and solution for the traveling salesman problem with multiple time windows

This paper applies the multi-time window traveling salesman problem to not only optimize logistics cost, but also effectively endow users with multiple discrete idle optional time periods meet requirements of just-in-time production. In process solving, firstly, dynamic penalty factor is introduced into objective function and added relax constraints in order construct relaxation model. Secondly, while solving model, compressed annealing algorithm, which has property probability convergence, proposed on basis simulated algorithm temperature parameter. The as a pressure parameter control transition an infeasible route regarding windows. Finally, comparison through data experiments between windows single-time verifies practicability former solution stability algorithm. result shows that comparatively better method solve problem.